Finding all pure strategy Nash equilibria in a planar location game
نویسندگان
چکیده
In this paper, we deal with a planar location-price game where firms first select their locations and then set delivered prices in order to maximize their profits. If firms set the equilibrium prices in the second stage, the game is reduced to a location game for which pure strategy Nash equilibria are studied assuming that the marginal delivered cost is proportional to the distance between the customer and the facility from which it is served. We present characterizations of local and global Nash equilibria. Then an algorithm is shown in order to find all possible Nash equilibrium pairs of locations. The minimization of the social cost leads to a Nash equilibrium. An example shows that there may exist multiple Nash equilibria which are not minimizers of the social cost.
منابع مشابه
Notes on Equilibria in Symmetric Games
In a symmetric game, every player is identical with respect to the game rules. We show that a symmetric 2strategy game must have a pure-strategy Nash equilibrium. We also discuss Nash’s original paper and its generalized notion of symmetry in games. As a special case of Nash’s theorem, any finite symmetric game has a symmetric Nash equilibrium. Furthermore, symmetric infinite games with compact...
متن کاملFinding Equilibria in Games of No Chance
We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show: 1. A maximin pure strategy for a two-player extensive form game with perfect recall and no moves of chance can be found in time linear in the size of the game tree. In contrast, it is known that this problem is NP-hard for games with cha...
متن کاملOn the existence of equilibria in discontinuous games: three counterexamples
We study whether we can weaken the conditions given in Reny [4] and still obtain existence of pure strategy Nash equilibria in quasiconcave normal form games, or, at least, existence of pure strategy ε−equilibria for all ε > 0. We show by examples that there are: 1. quasiconcave, payoff secure games without pure strategy ε−equilibria for small enough ε > 0 (and hence, without pure strategy Nash...
متن کاملThe influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
Game theory is a mathematical framework for representing interactions of rational players trying to achieve possibly contradictory goals. Players’ strategies are said to be in Nash equilibrium if no player can do better by unilaterally changing her strategy. Nash’s famous theorem [1] guarantees the existence of at least one such equilibrium when players are allowed to play mixed strategies, i.e...
متن کاملLocal-Effect Games
We present a new class of games, local-effect games (LEGs), which exploit structure in a different way from other compact game representations studied in A I . We show both theoretically and empirically that these games often (but not always) have pure-strategy Nash equilibria. Finding a potential function is a good technique for finding such equilibria. We give a complete characterization of w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 214 شماره
صفحات -
تاریخ انتشار 2011